Bounds of the Expected Approximation Error in Optimal Inventory Policies
نویسنده
چکیده
Bounds for the approximation error of optimal inventory policies are derived. The unknown distribution functions are approximated by normal distributions. The expectation of the errors are of order 00log(N) 1 2 ]:
منابع مشابه
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
In this paper, we consider two fundamental inventory models, the single-period newsvendor problem and its multiperiod extension, but under the assumption that the explicit demand distributions are not known and that the only information available is a set of independent samples drawn from the true distributions. Under the assumption that the demand distributions are given explicitly, these mode...
متن کاملNewsvendor Bounds and A Heuristic for Optimal Policies in Serial Supply Chains
We consider the classic N -stage serial supply systems with linear costs and stationary random demands. There are deterministic transportation leadtimes between stages, and unsatisfied demands are backlogged. The optimal inventory policy for this system is known to be an echelon base-stock policy, which can be computed through minimizing N nested convex functions recursively. To identify the ke...
متن کاملPathwise Properties and Performance Bounds for a Perishable Inventory System
We study a perishable inventory system under a fixed-critical number order policy. By using an appropriate transformation of the state vector, we derive several key sample-path relations. We obtain bounds on the limiting distribution of the number of outdates in a period, and we derive families of upper and lower bounds for the long-run number of outdates per unit time. Analysis of the bounds o...
متن کاملNew Policies for Stochastic Inventory Control Models: Theoretical and Computational Results
Recently Levi, Pál, Roundy and Shmoys introduced a novel, Dual-Balancing policy for the classical singleitem, single-location inventory model with backlogged demands and dynamic forecasts of future demands that evolve as time advances. These models are usually computationally intractable due to the enormous size of the state space. The expected cost of the dual-balancing policy is guaranteed to...
متن کاملComputing (r, Q) policy for an inventory system with limited sharable resource
This paper deals with an inventory system with limited resource for a single item or multiple items under continuous review (r, Q) policies. For the single-item system with a stochastic demand, a constant lead time, and limited resource, it is shown that an existing algorithm can be applied for finding an optimal (r, Q) policy that minimizes the expected system costs. For the multi-item system ...
متن کامل